CLASSICAL ISOMORPHISMS FOR QUANTUM GROUPS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classical Isomorphisms for Quantum Groups

The expressions for the R̂–matrices for the quantum groups SOq2(5) and SOq(6) in terms of the R̂–matrices for Spq(2) and SLq(4) are found, and the local isomorphisms of the corresponding quantum groups are established. On leave of absence from P.N.Lebedev Physical Institute, Theoretical Department, 117924 Moscow, Leninsky prospect 53, CIS.

متن کامل

Classical isomorphisms of types

The study of isomorphisms of types has been mainly carried out in an intuitionistic setting. We extend some of these works to classical logic for both call-by-name and call-by-value computations by means of polarized linear logic and game semantics. This leads to equational characterizations of these isomorphisms for all the propositional connectives.

متن کامل

Isomorphisms of Groups

Definition: If (G, *) and (H, •) are groups, then a function f : G −→ H is a homomorphism if f (x * y) = f (x) • f (y) for all x, y ∈ G. Example: Let (G, *) be an arbitrary group and H = {e}, then the function f : G −→ H such that f (x) = e for any x ∈ G is a homomorphism. In fact, f (x * y) = e = e • e = f (x) • f (y).

متن کامل

Isomorphisms of Graph Groups

Given a graph X, define the presentation PX to have generators the vertices of X, and a relation xy = yx for each pair x, y of adjacent vertices. Let GX be the group with presentation PX, and given a field K, let KX denote the K"-algebra with presentation PX. Given graphs X and Y and a field K, it is known that the algebras KX and KY are isomorphic if and only if the graphs X and Y are isomorph...

متن کامل

Computational isomorphisms in classical logic

All standard ‘linear’ boolean equations are shown to be computationally realized within a suitable classical sequent calculus LKp. Specifically, LKp can be equipped with a cut-elimination compatible equivalence on derivations based upon reversibility properties of logical rules. So that any pair of derivations, without structural rules, of F ⇒ G and G ⇒ F , where F , G are first-order formulas ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Modern Physics Letters A

سال: 1992

ISSN: 0217-7323,1793-6632

DOI: 10.1142/s0217732392001956